A Connectionist Symbol ManipulatorThat Discovers the Structure ofContext - Free

نویسندگان

  • Michael C. Mozer
  • Sreerupa Das
چکیده

We present a neural net architecture that can discover hierarchical and re-cursive structure in symbol strings. To detect structure at multiple levels, the architecture has the capability of reducing symbols substrings to single symbols, and makes use of an external stack memory. In terms of formal languages, the architecture can learn to parse strings in an LR(0) context-free grammar. Given training sets of positive and negative exemplars, the architecture has been trained to recognize many diierent grammars. The architecture has only one layer of modiiable weights, allowing for a straightforward interpretation of its behavior. Many cognitive domains involve complex sequences that contain hierarchical or recursive structure, e.g., music, natural language parsing, event perception. To illustrate , \the spider that ate the hairy y" is a noun phrase containing the embedded noun phrase \the hairy y." Understanding such multilevel structures requires forming reduced descriptions (Hinton, 1988) in which a string of symbols or states (\the hairy y") is reduced to a single symbolic entity (a noun phrase). We present a neural net architecture that learns to encode the structure of symbol strings via such reduction transformations. The diicult problem of extracting multilevel structure from complex, extended sequences has been studied by Mozer, among others. While these previous eeorts have made some

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Connectionist Symbol Manipulator that Discovers the Structure of Context-Free Languages

We present a neural net architecture that can discover hierarchical and recursive structure in symbol strings. To detect structure at multiple levels, the architecture has the capability of reducing symbols substrings to single symbols, and makes use of an external stack memory. In terms of formal languages, the architecture can learn to parse strings in an LR(O) contextfree grammar. Given trai...

متن کامل

Symbol Structures in Connectionist Networks: Five Properties and Two Architectures

We define five properties of symbol representations (called the Five M's) that together provide a powerful and flexible symbol processing facility. Our ideal symbol structures arc Mobile, Memorable, Meaningful, Malleable, and Modifiable. Conventional symbol processing architectures, such as Lisp on von Neumann machines, support some of these properties, but others seem to require flexibility an...

متن کامل

The Acquisition of New Categories through Grounded Symbols: An Extended Connectionist Model

Solutions to the symbol grounding problem, in psychologically plausible cognitive models, have been based on hybrid connectionist/symbolic architectures, on robotic approaches and on connectionist only systems. This paper presents new simulations on the use of neural network architectures for the grounding of symbols on categories. In particular, the connectivity patterns between layers of the ...

متن کامل

Learning grammars with recurrent neural networks

Most of language acquisition models that have been constructed so far are based on traditional AI approaches. On the other hand, artificial neural networks (ANNs), contrasting with traditional AI approaches, have many great abilities such as ability to learn, generalization capability and robustness. But they are poor in representing compositional structures and manipulating them, and are consi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993